Cloud-Assisted Private Set Intersection via Multi-Key Fully Homomorphic Encryption
نویسندگان
چکیده
With the development of cloud computing and big data, secure multi-party computation, which can collaborate with multiple parties to deal a large number transactions, plays an important role in protecting privacy. Private set intersection (PSI), form is formidable cryptographic technique that allows sender receiver calculate their not reveal any more information. As data volume increases application scenarios emerge, PSI participants increasingly needed. Homomorphic encryption algorithm designed perform mathematical-style operation on encrypted where decryption result same as calculated using unencrypted data. In this paper, we present cloud-assisted multi-key (CMPSI) system uses fully homomorphic over torus (TFHE) scheme encrypt server assist computation. Specifically, design some TFHE-based computation protocols build single server-based private support users. Moreover, security analysis performance evaluation show our feasible. The has smaller communication overhead compared existing schemes.
منابع مشابه
Cloud-Assisted Multiparty Computation from Fully Homomorphic Encryption
We construct protocols for secure multiparty computation with the help of a computationally powerful party, namely the “cloud”. Our protocols are simultaneously efficient in a number of metrics: • Rounds: our protocols run in 4 rounds in the semi-honest setting, and 5 rounds in the malicious setting. • Communication: the number of bits exchanged in an execution of the protocol is independent of...
متن کاملHomomorphic Encryption: From Private-Key to Public-Key
We show how to transform any additively homomorphic privatekey encryption scheme that is compact, into a public-key encryption scheme. By compact we mean that the length of a homomorphically generated encryption is independent of the number of ciphertexts from which it was created. We do not require anything else on the distribution of homomorphically generated encryptions (in particular, we do...
متن کاملPrivate Information Retrieval Based On Fully Homomorphic Encryption
We propose a construction of a single database private information retrieval system using fully homomorphic encryption. The construction results in a system with Ω(log2 n) communication complexity, and polylogarithmic computational overhead, in the size of the database. An improved construction is also proposed, which reduces the client’s communication overhead, and leaves open the possibility ...
متن کاملPrivate Compound Wildcard Queries using Fully Homomorphic Encryption
Fully homomorphic encryption (FHE) brings a paradigm shift in cryptographic engineering by enabling us to resolve various unsolved problems. Among them, this work solves the problem to design a private database query (PDQ) protocol that supports compound queries with wildcard conditions on encrypted databases using FHE. More precisely, we consider a setting where clients outsource an encrypted ...
متن کاملFaster Fully Homomorphic Encryption
We describe two improvements to Gentry's fully homomorphic scheme based on ideal lattices and its analysis: we provide a more aggressive analysis of one of the hardness assumptions (the one related to the Sparse Subset Sum Problem) and we introduce a probabilistic decryption algorithm that can be implemented with an algebraic circuit of low multiplicative degree. Combined together, these improv...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics
سال: 2023
ISSN: ['2227-7390']
DOI: https://doi.org/10.3390/math11081784